To solve the congestion problem of links in Data Center Network (DCN), a Topology-Aware Congestion Control (TACC) algorithm was proposed in data center networks. According to the properties of multi-dimensional orthogonality and single-dimensional full mesh in the generalized hypercube, a topology-aware strategy was put forward to find the disjoint routes of distributing the request of flow by the max-flow min-cut theorem. Then, the disjoint routes were adjusted adaptively for satisfying the bandwidth requirement. Finally, the residual bandwith of the selected path was used as the weight to dynamically adjust the flow distribution of each route, so as to achieve the purpose of alleviating network congestion, balancing the load of links and reducing the pressure of recombining data in the destination. The experimental results show that in comparison with Link Criticality Routing Algorithm (LCRA), Multipath Oblivious Routing Algorithm (MORA), Min-Cut Multi-Path (MCMP) and Congestion-Free Routing Strategy (CFRS), TACC algorithm has good performance in link load balancing and deployment time.